E.E. Just Lecture, 1996

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EE 228 a - Lecture - Spring 2006

We have, by now, seen the various uses of game theory in different aspects of networking like bandwidth trading, MAC Layer access, congestion control, etc. In this lecture, we will see how routing is modeled using game theory.

متن کامل

EE 228 a - Lecture 8 - Spring 2006

In this lecture, we investigate several scheduling policies for generalized communication networks. The goal is to maximize the network throughput under certain communication constraints. The network is modeled by a set of interconnected and interdependent queueing processes, and the constraints are specified in a service rate matrix. We show two scheduling policies that are optimal in some tec...

متن کامل

E. E. Just Award Lecture

What started as a game of discovery for a child with a chemistry set has resulted in a lifetime of fulfillment and dedication to science. It is deeply rewarding to continuously let my curiosity ask questions for which there are no known answers. Equally rewarding has been the opportunity to mentor young students and postdoctorate graduates through their formative years in science.

متن کامل

EE 223 : Stochastic Estimation and Control Spring 2007 Lecture 3 —

In this lecture, we argue that the optimal strategy in the finite horizon fully observed stochastic control problem we have been considering so far is a Markov strategy. In addition, we define the optimal cost-to-go functions associated to the problem and sketch a proof of the theorem that says that optimal Markov strategies must be defined in terms of the minimizers in the equations defining t...

متن کامل

EE 228 a - Lecture 9 - Spring 2006 Complexity and Routing

Two fundamental problems scheduling and routing present themselves in the networking field. Although some ”easy” routing algorithms based upon single constraint optimization exist, we will see that routing with multiple constraints becomes computationally difficult. In order to quantify their intractability, a brief overview of complexity theory will first be presented and then applied to routi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Molecular Biology of the Cell

سال: 1997

ISSN: 1059-1524,1939-4586

DOI: 10.1091/mbc.8.11.2101